首页> 外文OA文献 >Multi-Pair Two-Way Relay Network with Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling
【2h】

Multi-Pair Two-Way Relay Network with Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling

机译:具有Harvest-Then-Transmit用户的多对双向中继网络:   解决成对上行链路 - 下行链路耦合

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

While two-way relaying is a promising way to enhance the spectral efficiencyof wireless networks, the imbalance of relay-user distances may lead toexcessive wireless power at the nearby-users. To exploit the excessive power,the recently proposed harvest-then-transmit technique can be applied. However,it is well-known that harvest-then-transmit introduces uplink-downlink couplingfor a user. Together with the co-dependent relationship between paired usersand interference among multiple user pairs, wirelessly powered two-way relaynetwork suffers from the unique pairwise uplink-downlink coupling, and thejoint uplink-downlink network design is nontrivial. To this end, for the onepair users case, we show that a global optimal solution can be obtained. Forthe general case of multi-pair users, based on the rank-constrained differenceof convex program, a convergence guaranteed iterative algorithm with anefficient initialization is proposed. Furthermore, a lower bound to theperformance of the optimal solution is derived by introducing virtual receiversat relay. Numerical results on total transmit power show that the proposedalgorithm achieves a transmit power value close to the lower bound.
机译:尽管双向中继是提高无线网络频谱效率的一种有前途的方法,但是中继用户距离的不平衡可能会导致附近用户的无线功率过大。为了利用过剩的功率,可以应用最近提出的收获-然后-传送技术。然而,众所周知,收获然后发送为用户引入了上行链路-下行链路耦合。加上成对用户之间的相互依存关系和多个用户对之间的干扰,无线双向中继网络遭受独特的成对上行链路-下行链路耦合,并且联合上行链路-下行链路网络设计是不平凡的。为此,对于onepair用户的情况,我们表明可以获得全局最优解。针对多对用户的一般情况,基于凸程序的秩约束差异,提出了一种具有有效初始化的收敛保证迭代算法。此外,通过在中继上引入虚拟接收器,可以得出最佳解决方案性能的下限。关于总发射功率的数值结果表明,所提出的算法实现了接近下限的发射功率值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号